Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
نویسندگان
چکیده
The parallelization on a supercomputer of a one list dynamic programming algorithm using dominance technique and processor cooperation for the 0–1 knapsack problem is presented. Such a technique generates irregular data structure, moreover the number of undominated states is unforeseeable. Original and efficient load balancing strategies are proposed. Finally, computational results obtained with an Origin 3800 supercomputer are displayed and analyzed. To the best of our knowledge, this is the first time for which computational experiments on a supercomputer are presented for a parallel dynamic programming algorithm using dominance technique. © 2004 Elsevier Inc. All rights reserved.
منابع مشابه
An Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملSome Implementation Results on Random Polling Dynamic Load Balancing 2 Sequential Algorithms
Using two sample applications, we demonstrate the eeectiveness of our portable and reusable library for parallel tree search. On 1024 Transputers we achieve near optimal speedup even for quite small instances of the Golomb ruler problem. The 0/1 knapsack problem is more challenging but it is possible to achieve superlinear speedup compared to the standard sequential depth rst algorithm the impl...
متن کاملImplementation of a Region Growing Algorithm on Multicomputers: Analysis of the Work Load Balance
This paper discusses and evaluates different parallel implementations of a Region Growing algorithm based on the Split-and-Merge approach proposed by Horowitz and Pavlidis [1]. Region growing is a general technique for image segmentation. The basic scheme consists of joining adjacent pixels to form regions; adjacent regions are then merged to obtain larger regions. The solution has been conceiv...
متن کاملA Hypecube Algorithm for the 0/1 Knapsack Problem
Many combinatorial optimization problems are known to be NP-complete. A common point of view is that finding fast algorithms for such problems using polynomial number of processors is unlikely. However facts of this kind usually are established for "worst" case situations and in practice many instances of NP-complete problems are successfully solved in polynomial time by such traditional combin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 65 شماره
صفحات -
تاریخ انتشار 2005